Some Progress in the Symbolic Verification of Timed Automata
نویسندگان
چکیده
منابع مشابه
Transformation of MTCCS into an Extension of Timed Automata
This paper presents results from work in progress on finding a method for specification and formal verification of realtime concurrent systems incorporating a non-trivial data component. To model such systems, we use the real-time process algebra MTCCS, a Timed CCS variant, enhanced with a data manipulation model. Our verification method is based on the dual-language approach in which temporal ...
متن کاملQuantitative Robustness Analysis of Flat Timed Automata
Whereas formal verification of timed systems has become a very active field of research, the idealized mathematical semantics of timed automata cannot be faithfully implemented. Recently, several works have studied a parametric semantics of timed automata related to implementability: if the specification is met for some positive value of the parameter, then there exists a correct implementation...
متن کاملInterval Diagrams: Increasing Efficiency of Symbolic Real-Time Verification
In this paper, we suggest interval diagram techniques for formal verification of real-time systems modeled by means of timed automata. Interval diagram techniques are based on interval decision diagrams (IDDs)—representing sets of system configurations of, e.g., timed automata—and interval mapping diagrams (IMDs)— modeling their transition behavior. IDDs are canonical representations of Boolean...
متن کاملSymbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata
Probabilistic timed automata are a formalism for modelling systems whose dynamics includes probabilistic, nondeterministic and timed aspects including real-time systems. A variety of techniques have been proposed for the analysis of this formalism and successfully employed to analyse, for example, wireless communication protocols and computer security systems. Augmenting the model with prices (...
متن کاملSome Progress in the Symbolic Veri cation of Timed Automata
In this paper we discuss the practical di culty of analyzing the behavior of timed automata and report some results obtained using an experimental bdd based extension of kronos We have treated exam ples originating from timing analysis of asynchronous boolean networks and CMOS circuits with delay uncertainties and the results outperform those obtained by previous implementations of timed automa...
متن کامل